The kernel of a monoid morphism
نویسنده
چکیده
منابع مشابه
Logarithmic Structure for Stable Maps Relative to Simple Normal Crossing Divisor
P gp := {(a, b)|(a, b) ∼ (c, d) if ∃s ∈ P such that s+ a+ d = s+ b+ c}. The monoid P is called integral if the natural map P → P gp is injective. And it is called saturated if it is integral and satisfies that for any p ∈ P , if n · p ∈ P for some positive integer n then p ∈ P . A monoid P is said to be fine if it is integral and finitely generated. A monoid P is called sharp if there are no ot...
متن کاملSubpullbacks and coproducts of $S$-posets
In 2001, S. Bulman-Fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts $A_{S}$ over a monoid $S$ that can be described by means of when the functor $A_{S} otimes -$ preserves pullbacks. In this paper, we extend these results to $S$-posets and present equivalent descriptions of weakly kernel p...
متن کاملOn syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
We deal with the maximal bifix code construction which is a natural generalization of a group code construction. For a surjective morphism from a free monoidA∗ onto a completely simple semigroup with an adjoined identityM(G; I, J ; )1 and a submonoid S of M(G; I, J ; )1, under certain conditions, the base of a submonoid −1(S) is a maximal bifix code X. We investigate the relationships between t...
متن کاملDirected Containers as Categories
Directed containers make explicit the additional structure of those containers whose set functor interpretation carries a comonad structure. The data and laws of a directed container resemble those of a monoid, while the data and laws of a directed container morphism those of a monoid morphism in the reverse direction. With some reorganization, a directed container is the same as a small catego...
متن کاملAsymptotic properties of free monoid morphisms
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word w = g(f(a)) is the image of a fixed point of a morphism f under another morphism g, then there exist a non-erasing morphism σ and a coding τ such that w = τ (σ(b)). Based on the ...
متن کامل